Hypergraph products for structural mechanics
نویسندگان
چکیده
In this paper Cartesian, direct and strong Cartesian product of hypergraphs are investigated. A new concept named the adjacency function is defined on hypergraphs. This definition leads to distinct adjacency and Laplacian matrices for a hypergraph and makes it possible to express it in an algebraic form. Variable adjacency functions on hypergraphs result in generation of dynamic graph products which are applied to dynamic systems. For further clarity, some examples from structural mechanics are provided. The generality of the approach is shown through some examples, indicating this fact that the hypergraph products can encompass most of the available developments on the graph products in the literature.
منابع مشابه
A Survey on Hypergraph Products
A surprising diversity of different products of hypergraphs have been discussed in the literature. Most of the hypergraph products can be viewed as generalizations of one of the four standard graph products. The most widely studied variant, the so-called square product, does not have this property, however. Here we survey the literature on hypergraph products with an emphasis on comparing the a...
متن کاملHypergraph modelling for geometric model fitting
In this paper, we propose a novel hypergraph based method (called HF) to fit and segment multi-structural data. The proposed HF formulates the geometric model fitting problem as a hypergraph partition problem based on a novel hypergraph model. In the hypergraph model, vertices represent data points and hyperedges denote model hypotheses. The hypergraph, with large and “data-determined” degrees ...
متن کاملEla Spectral Properties of Oriented Hypergraphs
An oriented hypergraph is a hypergraph where each vertex-edge incidence is given a label of +1 or −1. The adjacency and Laplacian eigenvalues of an oriented hypergraph are studied. Eigenvalue bounds for both the adjacency and Laplacian matrices of an oriented hypergraph which depend on structural parameters of the oriented hypergraph are found. An oriented hypergraph and its incidence dual are ...
متن کاملHamilton Saturated Hypergraphs of Essentially Minimum Size
For 1 ≤ ` < k, an `-overlapping cycle is a k-uniform hypergraph in which, for some cyclic vertex ordering, every edge consists of k consecutive vertices and every two consecutive edges share exactly ` vertices. A k-uniform hypergraph H is `-Hamiltonian saturated, 1 ≤ ` ≤ k − 1, if H does not contain an `-overlapping Hamiltonian cycle C (k) n (`) but every hypergraph obtained from H by adding on...
متن کاملDecomposing complete 3-uniform hypergraphs into Hamiltonian cycles
Using the Katona-Kierstead definition of a Hamiltonian cycle in a uniform hypergraph, we continue the investigation of the existence of a decomposition of the complete 3-uniform hypergraph into Hamiltonian cycles began by Bailey and Stevens. We also discuss two extensions of the problem: to the complete 3-uniform hypergraph from which a parallel class of triples has been removed, and to the com...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Advances in Engineering Software
دوره 80 شماره
صفحات -
تاریخ انتشار 2015